Network flow based approaches for the pipelines routing problem in naval design

In this paper we propose a general methodology for the optimal automatic routing of spatial pipelines motivated by recent collaboration with Ghenova, leading Naval Engineering company. We provide minimum cost multicommodity network flow based model problem incorporating all technical requirements feasible pipeline routing. A branch-and-cut approach is designed and different matheuristic algorithms are derived solving efficiently problem. report results battery computational experiments to assess performance as well case study real-world naval instance provided our partner